Single Agents and the Set of Many-to-One Stable Matchings
نویسندگان
چکیده
منابع مشابه
Single Agents and the Set of Many-to-One Stable Matchings
Some properties of the set of many-to-one stable matchings for firms that have responsive preferences and quotas are not necessarily true when firms' preferences are substitutable. In particular, we provide examples in which firms have substitutable preferences but firms and workers may be ``single'' in one stable matching and matched in another one. We identify a set of axioms on firms' prefer...
متن کاملAn algorithm to compute the full set of many-to-many stable matchings
The paper proposes an algorithm to compute the full set of many-to-many stable matchings when agents have substitutable preferences. The algorithm starts by calculating the two optimal stable matchings using the deferred-acceptance algorithm. Then, it computes each remaining stable matching as the firm-optimal stable matching corresponding to a new preference profile which is obtained after mod...
متن کاملMany-to-One Packed Routing via Matchings
In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham 1]. We extend the model to allow more than one packet per origin and destination node. We give tight bounds for the many-to-one routing number for complete graphs, complete bipartite graphs and linear arrays. We also present an eecient algorithm for many-to-one routing on an trees (and ...
متن کاملApproximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)
We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness ...
متن کاملMany-to-one Matchings with Lower Quotas: Algorithms and Complexity
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A∪̇P,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P . We seek a maximum weight many-toone matching satisfying two sets of constraints: vertices in A are incident to at most one matching edge, while vertices in P are either ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2000
ISSN: 0022-0531
DOI: 10.1006/jeth.1999.2586